I/O Automaton Models and Proofs for Shared-Key Communication Systems
نویسنده
چکیده
The combination of two security protocols, a simple shared-key communication protocol and the Diffie-Hellman key distribution protocol, is modeled formally and proved correct. The modeling is based on the I/O automaton model for distributed algorithms, and the proofs are based on invariant assertions, simulation relations, and compositional reasoning. Arguments about the cryptosystems are handled separately from arguments about the protocols.
منابع مشابه
Hybrid I/O Automata
Abs t r ac t . We propose a new hybrid I/O automaton model that is capable of describing both continuous and discrete behavior. The model, which extends the timed I /O automaton model of [12, 7] and the phase transition system models of [15, 2], allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) the definition of h...
متن کاملCs - R 9578 1995
We propose a new hybrid I/O automaton model that is capable of describing both continuous and discrete behavior. The model, which extends the timed I/O automaton model of 12, 7] and the phase transition system models of 15, 2], allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) the deenition of hybrid I/O automata ...
متن کاملA Critical Review on Communication Paradigms Beteween Academic and Clinical Service Institutions in Nursing
Introduction: Clinical education is the duty of academic and clinical organizations and its effectiveness is influenced by the interaction of both organizations. Since the commencement of nursing profession, this interaction has experienced different paradigms. This paper is an endeavor for identification and critical analysis of these paradigms as well as the current trends of the interactions...
متن کاملCorrectness of vehicle control systems-a case study
Several example vehicle deceleration maneuvers arising in automated transportation systems are specified, and their correctness verified, using the hybrid I/O automaton model of Lynch, Segala, Vaandrager and Weinberg [16]. All system components are formalized using hybrid I/O automata, and their combination described using automaton composition. The proofs use invariant assertions, simulation m...
متن کاملI-homomorphism for BL-I-General L-fuzzy Automata
Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.Then for a given BL-intuitionistic general L-fuzzy automaton, we obtain the greatest I-bisimulation. According to this notion, we give the structure of quotient BL-intuiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999